On devising Boolean Routing schemes
نویسندگان
چکیده
منابع مشابه
On the Hardness of Devising Interval Routing Schemes
The k-Interval Routing Scheme (k-IRS) is a compact routing scheme on general networks. It has been studied extensively and recently been implemented on the latest generation of the INMOS transputer router chips. In this paper we investigate the time complexity of devising a minimal space k-IRS and we prove that the problem of deciding whether there exists a 2-IRS for any network G is NP-complet...
متن کاملBoolean Routing on Chordal Rings
In this paper we consider the problem of routing messages in a network of processors conngured as a chordal ring. In particular we refer to the Boolean Routing model, and we introduce a new routing function for unidirectional and bidirectional chordal rings with degree four. This function requires O(n log n) bits of storage and O(n) time to compute, in the worst case. We also study some relatio...
متن کاملBoolean Routing on Cayley Networks
We study Boolean routing on Cayley networks. Let K (M G) denote the Kolmogorov complexity of the multiplication table of a group G of order n. We show that O(maxfd logn; K (M G)g) memory bits per local router (hence a total of O(n maxfd logn; K (M G)g) memory bits) are suucient to do Boolean routing on the Cayley network constructed from the group G and a set of d generators. It is a consequenc...
متن کاملOn Interval Routing Schemes and Treewidth
In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each fixed k ≥ 1, the class of graphs allowing such routing schemes is closed under minor-taking in the domain of connected graphs, and hence has a linear time recognition algorithm. This result connects the theory of compact routing w...
متن کاملOn Multi-Label Linear Interval Routing Schemes
We consider linear interval routing schemes studied by [3, 5] from a graph-theoretic perspective. We examine how the number of linear intervals needed to obtain shortest path routings in networks is affected by the product, join and composition operations on graphs. This approach allows us to generalize some of the results of [3, 5] concerning the minimum number of intervals needed to achieve s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)86543-7